Quasi - Newton Trust - Region Method
نویسندگان
چکیده
The classical trust-region method for unconstrained minimization can be augmented with a line search that finds a point that satisfies the Wolfe conditions. One can use this new method to define an algorithm that simultaneously satisfies the quasi-Newton condition at each iteration and maintains a positive-definite approximation to the Hessian of the objective function. This new algorithm has strong global convergence properties and is robust and efficient in practice.
منابع مشابه
Implementation of a Trust Region Model Management Strategy in the Dakota Optimization Toolkit
A trust region-based optimization method has been incorporated into the DAKOTA optimization software toolkit. This trust region approach is designed to manage surrogate models of the objective and constraint functions during the optimization process. In this method, the surrogate functions are employed in a sequence of optimization steps, where the original expensive objective and constraint fu...
متن کاملA limited memory adaptive trust-region approach for large-scale unconstrained optimization
This study concerns with a trust-region-based method for solving unconstrained optimization problems. The approach takes the advantages of the compact limited memory BFGS updating formula together with an appropriate adaptive radius strategy. In our approach, the adaptive technique leads us to decrease the number of subproblems solving, while utilizing the structure of limited memory quasi-Newt...
متن کاملReduced Storage, Quasi-Newton Trust Region Approaches to Function Optimization
In this paper we consider several algorithms for reducing the storage when using a quasi-Newton method in a dogleg–trust region setting for minimizing functions of many variables. Secant methods require O(n2) locations to store an approximate Hessian and O(n2) operations per iteration when minimizing a function of n variables. This storage requirement becomes impractical when n becomes large. O...
متن کاملVariational Integrators
V sequence fxkg. Similar result is also true for quasiNewton methods with trust region (see [16]). Another type of special quasi-Newton methods is that the quasi-Newton matrices are sparse. It is quite often that large-scale problems have separable structure, which leads to special structure of the Hessian matrices. In such cases we can require the quasiNewton matrices to have similar structures.
متن کاملOn efficiently combining limited-memory and trust-region techniques
Limited memory quasi-Newton methods and trust-region methods represent two efficient approaches used for solving unconstrained optimization problems. A straightforward combination of them deteriorates the efficiency of the former approach, especially in the case of large-scale problems. For this reason, the limited memory methods are usually combined with a line search. We show how to efficient...
متن کامل